A Theory of Convergence Order of Maxmin Rate Allocation and an Optimal Protocol
نویسندگان
چکیده
The problem of allocating maxmin rates with minimum rate constraints for connection-oriented networks is considered. This paper proves that the convergence of maxmin rate allocation satisfies a partial ordering in the bottleneck links. This partial ordering leads to a tighter lower bound for the convergence time for any maxmin protocol. An optimally fast maxmin rate allocation protocol called the Distributed CPG protocol is designed based on this ordering theory. The new protocol employs bi-directional minimization and does not induce transient oscillations. The Distributed CPG protocol is compared against ERICA, showing far superior performance.
منابع مشابه
An Optimal Distributed Protocol for Fast Convergence to Maxmin Rate Allocation
The problem of allocating maxmin rates with minimum rate guarantees for connection-oriented networks is considered. This technical report builds on previous work [RT00a, RT00b]. Based on the theory presented in this previous work, an optimally fast maxmin rate allocation protocol called Distributed CPG Protocol is designed. The contributions are twofold. On one hand, the signaling protocol that...
متن کاملEnd-to-end maxmin fairness in multihop wireless networks: Theory and protocol
To promote commercial deployment of multihop wireless networks, the research/industry communities must develop new theories and protocols for flexible traffic engineering in these networks in order to support diverse user applications. This paper studies an important traffic engineering problem – how to support fair bandwidth allocation among all end-to-end flows in a multihop wireless network ...
متن کاملFair Allocation of Discrete Bandwidth Layers in Multicast Networks
We study fairness when receivers in a multicast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in [29], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly differe...
متن کاملOF INFOCOM 2000 1 Fair Allocation of Discrete Bandwidth Layers in Multicast
| We study fairness when receivers in a multi-cast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in 14], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly diier...
متن کاملEvaluating the Performance of Forecasting Models for Portfolio Allocation Purposes with Generalized GRACH Method
Portfolio theory assumes that investors accept risk. This means thatin the equal rate of return on the two assets, the assets were chosenthat have a lower risk level. Modern portfolio theory is accepted byinvestors who believe that they are not cope with the market. Sothey keep many different types of securities in order to access theoptimum efficiency rate that is close to the rate of return o...
متن کامل